منابع مشابه
Linear Interval Routing
We study a variant of Interval Routing SK85, LT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap around. This kind of routing schemes arises naturally in the study of dynamic Preex Routing BLT90]. Linear Interval Routing schemes are precisely the Preex Routing schemes that use an alphabet of one symbol. We characterize the...
متن کاملMasked Interval Routing: A New Routing Scheme
We introduce the new Masked Interval Routing Scheme, MIRS for short, where a mask is added to each interval to indicate particular subsets of "consecutive" labels. Interval routing becomes more exible, with the classical IRS scheme being a special case of MIRS. We then take two directions. First we show that the interval information stored in the network may be drastically reduced in the hard c...
متن کاملOptimal Interval Routing
Interval routing was introduced to reduce the size of the routing tables. This way of implementing routing functions is quite attractive but very few is known on the topological properties that should satisfy a network to admit an interval routing function satisfying particular constraints (shortest paths, limited number of intervals associated to each direction, etc). In this paper, we investi...
متن کاملOrdered Interval Routing
An Interval Routing Scheme (IRS) represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most k intervals per edge label is called a k-IRS. In this thesis, we propose a new type of interval routing scheme, called an Ordered In...
متن کاملA survey on interval routing
We survey in this paper the classical results, and also the most recent results, in the eld of Interval Routing, a well-known strategy to code in a compact way distributed routing algorithms. These results are classi ed in several themes: characterization, compactness and shortest path, dilation and stretch factor, speci c class of graphs (interconnection networks, bounded degree, planar, chord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1987
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/30.4.298